Using Clustering Approach Privacy Preserving Update to Anonymous and Confidential Databases
نویسندگان
چکیده
In order to update k-anonymous and confidential database, the suppression based and generalization based updating protocol technique has been proposed. These protocols check whether the database inserted with the new tuple is still k anonymous without knowing the content of the table and database respectively. But these methods will not work if initial database is empty. Also, if the incoming tuple that fails the test of these updating protocols, there is no solution for which action to be taken. So, in this paper we propose two solutions based on pending tuple set (i. e. a collection of all tuples that fails anonymous property of database) namely the private extraction of k-anonymous part of pending tuple set or k-anonymization of pending tuple set by privately suppressing entries.
منابع مشابه
A centralized privacy-preserving framework for online social networks
There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...
متن کاملSorted Nearest Neighborhood Clustering for Efficient Private Blocking
Record linkage is an emerging research area which is required by various real-world applications to identify which records in different data sources refer to the same real-world entities. Often privacy concerns and restrictions prevent the use of traditional record linkage applications across different organizations. Linking records in situations where no private or confidential information can...
متن کاملPrivacy Preserving DBSCAN Algorithm for Clustering
In this paper we address the issue of privacy preserving clustering. Specially, we consider a scenario in which two parties owning confidential databases wish to run a clustering algorithm on the union of their databases, without revealing any unnecessary information. This problem is a specific example of secure multi-party computation and as such, can be solved using known generic protocols. H...
متن کاملA Privacy Preserving Clustering Method Based on Fuzzy Approach and Random Rotation Perturbation
Individual privacy issues arise in these days when organizations using clustering as a data analysis tool. Private and sensitive data available in criminal, healthcare and financial records need to be preserved and also avoid the privacy leakage with the data mining system. In this paper, a privacy preserving clustering method is proposed for protecting the underlying sensitive attribute values...
متن کاملPrivacy Preserving and Security Control Method for Statistical Database
--As organizations increase their reliance on, possibly distributed, information systems for daily business, they become more vulnerable to security breaches even as they gain productivity and efficiency advantages. The availability of huge numbers of databases recording a large variety of information about individuals makes it possible to discover information about specific individuals by simp...
متن کامل